Online Submodular Maximization with Preemption
نویسندگان
چکیده
Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study a natural online variant of this problem in which elements arrive one-by-one and the algorithm has to maintain a solution obeying certain constraints at all times. Upon arrival of an element, the algorithm has to decide whether to accept the element into its solution and may preempt previously chosen elements. The goal is to maximize a submodular function over the set of elements in the solution. We study two special cases of this general problem and derive upper and lower bounds on the competitive ratio. Specifically, we design a 1/e-competitive algorithm for the unconstrained case in which the algorithm may hold any subset of the elements, and constant competitive ratio algorithms for the case where the algorithm may hold at most k elements in its solution. Statistics and Operations Research Dept., Tel Aviv University, Israel. E-mail: [email protected]. Research supported by ISF grant 954/11 and BSF grant 2010426. School of Computer and Communication Sciences, EPFL, Switzerland. E-mail: [email protected]. Research supported in part by ERC Starting Grant 335288-OptApprox. Dept. of Computer Science, Princeton University, Princeton, NJ. E-mail: [email protected].
منابع مشابه
Adapting Kernel Representations Online Using Submodular Maximization
Kernel representations provide a nonlinear representation, through similarities to prototypes, but require only simple linear learning algorithms given those prototypes. In a continual learning setting, with a constant stream of observations, it is critical to have an efficient mechanism for sub-selecting prototypes amongst observations. In this work, we develop an approximately submodular crit...
متن کاملSubmodular Maximization using Test Scores
We consider the closely related problems of maximizing a submodular function subject to a cardinality constraint and that of maximizing the sum of submodular functions subject to a partition matroid contraint. Motivated by applications in team selection, we focus on settings where the function(s) can be expressed as the expected value of a symmetric submodular value function of a set of indepen...
متن کاملOnline Submodular Maximization with Free Disposal: Randomization
We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying matroid. In each round when a new element arrives, the algorithm may accept the new element into its feasible set and possibly remove elements from it, provid...
متن کاملThe Power of Randomization: Distributed Submodular Maximization on Massive Datasets
A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. Unfortunately, the resulting submodular optimization problems are often too large to be solved on a single machine. We develop a simple distributed algorithm that is embarrassingly parallel and it achieves prova...
متن کاملDiscrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline
We consider the problem of stochastic monotone submodular function maximization, subject to constraints. We give results on adaptivity gaps, and on the gap between the optimal offline and online solutions. We present a procedure that transforms a decision tree (adaptive algorithm) into a non-adaptive chain. We prove that this chain achieves at least τ times the utility of the decision tree, ove...
متن کامل